Due window assignment and scheduling on parallel machines: a FPTAS for a bottleneck criterion
نویسندگان
چکیده
منابع مشابه
Due window assignment and scheduling on parallel machines: a FPTAS for a bottleneck criterion
A fully polynomial time approximation scheme (FPTAS) with run time O( n m εm−1 ) is developed for a problem which combines common due window assignment and scheduling n jobs on m identical parallel machines. The problem criterion is bottleneck (min-max) such that the maximum cost, which includes job earliness, job tardiness and due window size costs, is minimized.
متن کاملSoft due window assignment and scheduling of unit-time jobs on parallel machines
We study problems of scheduling n unit-time jobs on m identical parallel machines, in which a common due window has to be assigned to all jobs. If a job is completed within the due window, then no scheduling cost incurs. Otherwise, a job-dependent earliness or tardiness cost incurs. The job completion times, the due window location and the size are integer valued decision variables. The objecti...
متن کاملScheduling a deteriorating maintenance activity and due-window assignment
Several papers published during the last decade dealt with scheduling a maintenance activity and considered a new setting, where the maintenance duration is assumed to be deteriorating, i.e., it requires more time or effort if it is delayed. We study a deteriorating maintenance in the context of due-window assignment, where a time interval is determined such that jobs completed within this inte...
متن کاملScheduling problems with a common due window assignment: A survey
In this article a survey of studies on scheduling problems with a common due window assignment and earliness/tardiness penalty functions is presented. A due window is a generalization of the classical due date and describes a time interval in which a job should be finished. If a job is completed before or after the due window, it incurs an earliness or a tardiness penalty, respectively. In this...
متن کاملCommon Due-Date Assignment and Scheduling on Parallel Machines with Sequence-Dependent Setup Times
This paper considers common due-date assignment and scheduling on parallel machines. The main decisions are: (a) deter-mining the common due-date; (b) allocating jobs to machines; and (c) sequencing the jobs assigned to each machine. The objective is to minimize the sum of the penalties associated with common due-date assignment, earliness and tardiness. As an extension of the existing studies ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Polish Academy of Sciences Technical Sciences
سال: 2014
ISSN: 2300-1917
DOI: 10.2478/bpasts-2014-0088